Uniform Cost Search (UCS) is an algorithm that explores a graph by expanding the node with the lowest path cost from the start node. It guarantees the shortest path by considering the actual cost to reach each node.
Path Cost (g(n)): The actual cost from the start node to the current node. The algorithm always chooses the node with the lowest g(n).
Why a Node is Chosen: The node with the lowest path cost (g(n)) is selected from the frontier.
Goal Vector: undefined
Frontier: []
Path Costs: []
Visiting: undefined
To Visit: undefined
Currently visitable nodes: undefined
Path Cost g(n): undefined
Edge Cost: undefined
Total Cost: undefined